منابع مشابه
Palindromic Richness
In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are ‘rich’ in palindromes in the utmost sense. A characteristic property of so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author toget...
متن کامل2 01 1 Generalized Thue - Morse words and palindromic richness
is valid for any infinite word u with language closed under reversal and for any n. Therefore, the fact that a word u is rich in palindromes expresses that u is saturated by palindromes up to the highest possible level. Arnoux-Rauzy words (among them Sturmian words) and words coding interval exchange transformation with the symmetric permutation belong to the most prominent examples of rich wor...
متن کاملLanguages invariant under more symmetries: Overlapping factors versus palindromic richness
Factor complexity C and palindromic complexity P of infinite words with language closed under reversal are known to be related by the inequality P(n) + P(n + 1) ≤ 2 + C(n + 1) − C(n) for any n ∈ N . Word for which the equality is attained for any n is usually called rich in palindromes. In this article we study words whose languages are invariant under a finite group G of symmetries. For such w...
متن کاملPalindromic Permutations and Generalized Smarandache Palindromic Permutations
The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups Sn of degree n. It is shown that in Sn, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S2 and S3). The dihedral group Dn is shown to be generated by a RGSPP and a LGSPP(this is observed to ...
متن کاملPalindromic Differences
Let x denote a positive integer, written in the ordinary denary form, and define its palindromic inverse x T to be the integer obtained from x by writing its digits in reverse order. We ignore leading zeros so that both 1234 and 12340 have palindromic inverse 4321. A number is called a palindrome if x = x f. Similar definitions apply to bases other than 10. A notorious problem concerns palindro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2009
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2008.04.006